#include "algorithm.h"
#include <vector>

using namespace std;

void Algorithm::run(Graph &g, int server_cost, vector<vector<int> > &pathset) {
	for (int i = 0; i < g.node_cnt; i++) {
		int cid = g.node_map[i].cid;
		int request_bw = g.node_map[i].request_bw;
		if (cid != -1) {
			vector<int> path;
			path.push_back(i);
			path.push_back(cid);
			path.push_back(request_bw);
			
			pathset.push_back(path);
		}
	}
}